منابع مشابه
A Random Graph Model for Power Law Graphs
We propose a random graph model which is a special case of sparse random graphs with given degree sequences which satisfy a power law. This model involves only a small number of parameters, called logsize and log-log growth rate. These parameters capture some universal characteristics of massive graphs. Furthermore, from these parameters, various properties of the graph can be derived. For exam...
متن کاملEigenvalues of Random Power Law Graphs
Many graphs arising in various information networks exhibit the “power law” behavior – the number of vertices of degree k is proportional to k−β for some positive β. We show that if β > 2.5, the largest eigenvalue of a random power law graph is almost surely (1 + o(1)) √ m where m is the maximum degree. Moreover, the k largest eigenvalues of a random power law graph with exponent β have power l...
متن کاملEigenvalues of Random Power Law Graphs (DRAFT)
Many graphs arising in various information networks exhibit the “power law” behavior – the number of vertices of degree k is proportional to k−β for some positive β. We show that if β > 2.5, the largest eigenvalue of a random power law graph is almost surely (1+o(1)) √ m where m is the maximum degree. When 2 < β < 2.5, the largest eigenvalue is heavily concentrated at cm3−β for some constant c ...
متن کاملDistance Labelings on Random Power Law Graphs
Methods for answering distance queries on large graphs through a preprocessed data structure have a rich history of study. Recent evaluations on social and information networks have shown that there are very efficient landmark based labeling schemes on these networks, even for exact distances. However, it is unclear what are the essential properties of these networks that make short labelings p...
متن کاملRandom Walks with Lookahead on Power Law Random Graphs
We show that in power law random graphs, a.s., the expected rate at which a random walk with lookahead discovers the nodes of the graph is sublinear. Searching a graph by simulating a random walk is a natural way to abstract Web crawling [5]. Recently, the random walk simulation method has been also proposed to search P2P networks [11], [4], [10]. Therefore, it is important to characterize the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Experimental Mathematics
سال: 2001
ISSN: 1058-6458,1944-950X
DOI: 10.1080/10586458.2001.10504428